Improving binary crow search algorithm for feature selection

نویسندگان

چکیده

Abstract The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the optimal solution. For problems, selecting most relevant features of a dataset leads better accuracy with low training time. In this work, hybrid binary crow search algorithm (BCSA) based quasi-oppositional (QO) method is proposed FS on wrapper mode solve problem. QO was employed tuning value flight length BCSA which controlling ability crows find To evaluate performance method, four benchmark datasets have been used are human intestinal absorption, HDAC8 inhibitory activity (IC50), P-glycoproteins, antimicrobial. Accordingly, experimental results discussed compared against other standard algorithms rate, average number selected features, running proven robustness relied high obtained (84.93–95.92%), G -mean (0.853–0.971%), (4.36–11.8) relatively computational Moreover, investigate effectiveness Friedman test declared that supremacy BCSA-QO very evident CSA by minimum producing highest rate. verify usefulness (BCSA-QO) terms accuracy, small

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

Fast SFFS-Based Algorithm for Feature Selection in Biomedical Datasets

Biomedical datasets usually include a large number of features relative to the number of samples. However, some data dimensions may be less relevant or even irrelevant to the output class. Selection of an optimal subset of features is critical, not only to reduce the processing cost but also to improve the classification results. To this end, this paper presents a hybrid method of filter and wr...

متن کامل

Hybrid Binary Imperialist Competition Algorithm and Tabu Search Approach for Feature Selection Using Gene Expression Data

Gene expression data composed of thousands of genes play an important role in classification platforms and disease diagnosis. Hence, it is vital to select a small subset of salient features over a large number of gene expression data. Lately, many researchers devote themselves to feature selection using diverse computational intelligence methods. However, in the progress of selecting informativ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of intelligent systems

سال: 2023

ISSN: ['2191-026X', '0334-1860']

DOI: https://doi.org/10.1515/jisys-2022-0228